Automating the Verification of Realtime Observers Using Probes and the Modal mu-calculus

نویسندگان

  • Silvano Dal-Zilio
  • Bernard Berthomieu
چکیده

A classical method for model-checking timed properties—such as those expressed using timed extensions of temporal logic—is to rely on the use of observers. In this context, a major problem is to prove the correctness of observers. Essentially, this boils down to proving that: (1) every trace that contradicts a property can be detected by the observer; but also that (2) the observer is innocuous, meaning that it cannot interfere with the system under observation. In this paper, we describe a method for automatically testing the correctness of realtime observers. This method is obtained by automating an approach often referred to as visual verification, in which the correctness of a system is performed by inspecting a graphical representation of its state space. Our approach has been implemented on the tool Tina, a model-checking toolbox for Time Petri Net.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying Multiparty Call in ATM UNI Signalling Protocol

This paper presents formal specification and verification of the multiparty call in ATM UNI signalling protocol. The protocol specification is written in the CCS process algebra (Calculus of Communicating Systems). Verification is done by using the NCSU-Concurrency Workbench. Due to the complexity of the protocol, the model is decomposed into three components. The protocol is verified by the mo...

متن کامل

Efficient Graph-based Algorithms for Model Checking in the Modal Mu-calculus Abstract of the Dissertation Eecient Graph-based Algorithms for Model Checking in the Modal Mu-calculus

of the Dissertation E cient Graph-Based Algorithms for Model Checking in the Modal Mu-Calculus by Oleg Sokolsky Doctor of Philosophy in Computer Science State University of New York at Stony Brook 1996 Various model-checking algorithms for the alternation-free subset of the modal mu-calculus are considered. The algorithms are based on a data structure called the product graph, which represents ...

متن کامل

Compositional Analysis for Verification of Parameterized Systems

Many safety-critical systems that have been considered by the verification community are parameterized by the number of concurrent components in the system, and hence describe an infinite family of systems. Traditional model checking techniques can only be used to verify specific instances of this family. In this paper, we present a technique based on compositional model checking and program an...

متن کامل

Games for Verification: Algorithmic Issues

This dissertation deals with a number of algorithmic problems motivated by computer aided formal verification of finite state systems. The goal of formal verification is to enhance the design and development of complex systems by providing methods and tools for specifying and verifying correctness of designs. The success of formal methods in practice depends heavily on the degree of automation ...

متن کامل

Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems

In model checking for temporal logic, the correctness of a system with respect to a desired behavior is verified by checking whether a structure that models the system satisfies a formula describing the behavior. Most existing verification techniques are based on a representation of the system by means of a labeled transition system. In this approach to verification, the efficiency of the model...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015